翻訳と辞書
Words near each other
・ Lõpe
・ Lõpe, Hiiu County
・ Lõpe, Ida-Viru County
・ Lõpe, Jõgeva County
・ Lõpe, Pärnu County
・ Lõpemetsa
・ Lõpi
・ Lõputu päev
・ Lõu
・ Lõuka
・ Lõupõllu
・ Lõve
・ Lõõdla
・ Lõõla
・ Löb Nevakhovich
Löb's theorem
・ Löbau
・ Löbau (Sachs) station
・ Löbau-Zittau
・ Löbauer Berg
・ Löbauer Wasser
・ Löbau–Zittau railway
・ Löbejün
・ Löbenberg
・ Löbenicht
・ Löbenicht Church
・ Löbenicht Realgymnasium
・ Löbenicht Town Hall
・ Löberschütz
・ Löberöd


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Löb's theorem : ウィキペディア英語版
Löb's theorem
In mathematical logic, Löb's theorem states that in a theory with Peano arithmetic, for any formula ''P'', if it is provable that "if ''P'' is provable then ''P'' is true", then ''P'' is provable. I.e.
:\mathrm\ PA \vdash (Bew(\# P) \rightarrow P)\mathrm\ PA \vdash P
where ''Bew''(#''P'') means that the formula ''P'' with Gödel number #''P'' is provable (from the German "beweisbar").
Löb's theorem is named for Martin Hugo Löb, who formulated it in 1955.
==Löb's theorem in provability logic==
Provability logic abstracts away from the details of encodings used in Gödel's incompleteness theorems by expressing the provability of \phi in the given system in the language of modal logic, by means of the modality .
Then we can formalize Löb's theorem by the axiom
:\Box(\Box P\rightarrow P)\rightarrow \Box P,
known as axiom GL, for Gödel-Löb. This is sometimes formalised by means of an inference rule that infers
: P
from
:\Box P\rightarrow P.
The provability logic GL that results from taking the modal logic ''K4'' (or ''K'', since the axiom schema 4, \Box A\rightarrow\Box\Box A, then becomes redundant) and adding the above axiom GL is the most intensely investigated system in provability logic.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Löb's theorem」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.